Aggregating Interval Orders by Propositional Optimization
نویسندگان
چکیده
Aggregating preferences for finding a consensus between several agents is an important issue in many fields, like economics, decision theory and artificial intelligence. In this paper we focus on the problem of aggregating interval orders which are special preference structures allowing the introduction of tresholds for the indifference relation. We propose to solve this problem by first translating it into a propositional optimization problem, namely the Binate Covering Problem, then to solve the latter using a MAX-SAT solver. We discuss some properties of the proposed encoding and provide some hints about its practicability using preliminary experimental results.
منابع مشابه
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
The study of interval temporal logics on linear orders is a meaningful research area in computer science and artificial intelligence. Unfortunately, even when restricted to propositional languages, most interval logics turn out to be undecidable. Decidability has been usually recovered by imposing severe syntactic and/or semantic restrictions. In the last years, tableau-based decision procedure...
متن کاملOptimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders
In this paper, we focus our attention on tableau systems for the propositional interval logic of temporal neighborhood (Propositional Neighborhood Logic, PNL for short). PNL is the proper subset of Halpern and Shoham’s modal logic of intervals whose modalities correspond to Allen’s relations meets and met by. We first prove by a modeltheoretic argument that the satisfiability problem for PNL ov...
متن کاملA Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: An Implementation
Interval temporal logics are quite expressive temporal logics, which turn out to be difficult to deal with in many respects. Even finite satisfiability of simple interval temporal logics presents non-trivial technical issues when it comes to the implementation of efficient tableaubased decision procedures. We focus our attention on the logic of Allen’s relation meets, a.k.a. Right Propositional...
متن کاملA First Study of the Horn Fragment of the Modal Logic of Time Intervals
Interval temporal logics provide a natural framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. The most influential propositional interval-based logic is probably Halpern’s and Shoham Modal Logic of Time Intervals, a.k.a. HS. While most studies focused on the computational properties of the sy...
متن کاملUsing Taxonomic Background Knowledge in Propositionalization and Rule Learning
Knowledge representations using semantic web technologies often provide information which translates to explicit term and predicate taxonomies in relational learning. Here we show how to speed up the process of propositionalization of relational data by orders of magnitude, by exploiting such ontologies through a novel refinement operator used in the construction of conjunctive relational featu...
متن کامل